• Article  

      Architectural support for data-driven execution 

      Matheou, George; Evripidou, Paraskevas (2014)
      The exponential growth of sequential processors has come to an end, and thus, parallel processing is probably the only way to achieve performance growth. We propose the development of parallel architectures based on ...
    • Article  

      A case for chip multiprocessors based on the data-driven multithreading model 

      Trancoso, Pedro; Evripidou, Paraskevas; Stavrou, Kyriakos; Kyriacou, Costas (2006)
      Current high-end microprocessors achieve high performance as a result of adding more features and therefore increasing complexity. This paper makes the case for a Chip-Multiprocessor based on the Data-Driven Multithreading ...
    • Article  

      Communication assist for data driven multithreading 

      Kyriacou, Costas; Evripidou, Paraskevas (2003)
      Latency tolerance is one of the main concerns in parallel processing. Data Driven Multithreading, a technique that uses extra hardware to schedule threads for execution based on data availability, allows for better ...
    • Conference Object  

      Data-flow vs control-flow for extreme level computing 

      Evripidou, Paraskevas; Kyriacou, Costas (Institute of Electrical and Electronics Engineers Inc., 2014)
      This paper challenges the current thinking for building High Performance Computing (HPC) Systems, which is currently based on the sequential computing also known as the von Neumann model, by proposing the use of Novel ...
    • Article  

      Fine-grained parallelism in dynamic Web content generation: The parse and dispatch approach 

      Papastavrou, Stavros; Samaras, George S.; Evripidou, Paraskevas; Chrysanthis, Panos K. (2003)
      Dynamic Web content is gaining in popularity over traditional static HTML as the means of providing Web users with personalized and dynamic information. To enable dynamic content, various technologies have been developed ...
    • Article  

      Impossibility results for weak threshold networks 

      Busch, Costas; Mavronicolas, Marios (1997)
      It is shown that a weak threshold network (in particular, threshold network) of width w and depth d cannot be constructed from balancers of width p0, p1, . . . , pm-1, if w does not divide Pd, where P is the least common ...
    • Conference Object  

      Modeling value speculation 

      Sazeides, Yiannakis (IEEE Computer Society, 2002)
      Several studies of speculative execution based on values have reported promising performance potential. However, virtually all microarchitectures in these studies were described in an ambiguous manner, mainly due to the ...
    • Article  

      Net-dbx: A web-based debugger of MPI programs over low-bandwidth lines 

      Neophytou, Neophytos; Evripidou, Paraskevas (2001)
      This paper describes Net-dbx, a tool that utilizes Java and other World Wide Web tools for the debugging of MPI programs from anywhere in the Internet. Net-dbx is a source-level interactive debugger with the full power of ...
    • Conference Object  

      A neural-type parallel algorithm for fast matrix inversion 

      Polycarpou, Marios M.; Ioannou, P. A. (1991)
    • Article  

      On the complexity of parallelizing sequential circuits using the parallel-prefix method 

      Hadjicostis, Christoforos N. (2001)
      The parallel-prefix method uses a tree of identical processing nodes to calculate in parallel, the state and output response of a finite-state machine (FSM) to a finite-length input sequence. Traditionally, each computing ...
    • Article  

      An optimization of context sharing for self-adaptive mobile applications 

      Paspallis, Nearchos; Papadopoulos, George Angelos (2008)
      Because of the high potential of mobile and pervasive computing systems, there is an ongoing trend in developing applications exhibiting context awareness and adaptive behavior. While context awareness guarantees that the ...
    • Conference Object  

      A parallel implementation of a multi-objective evolutionary algorithm 

      Kannas, Christos C.; Nicolaou, Christos A.; Pattichis, Constantinos S. (2009)
      Multi-objective Evolutionary Algorithms (MOEAs) have features that can be exploited to harness the processing power offered by modern multi-core CPUs. Modern programming languages offer the ability to use threads and ...
    • Article  

      Parallel Implementations of the Selection Problem: A Case Study 

      Daumas, Marc; Evripidou, Paraskevas (2000)
      The selection problem has been studied extensively on sequential machines. A linear average time solution and a linear worst-case solution are considered as the standard by most researchers. Theoretical work is also available ...
    • Conference Object  

      Programming abstractions and toolchain for dataflow multithreading architectures 

      Stavrou, Kyriakos; Pavlou, Demos; Nikolaides, Marios; Petrides, P.; Evripidou, Paraskevas; Trancoso, Pedro; Popovic, Z.; Giorgi, Roberto (2009)
      The need to exploit multi-core systems for parallel processing has revived the concept of dataflow. In particular, the Dataflow Multithreading architectures have proven to be good candidates for these systems. In this work ...
    • Article  

      Topic 1: Support tools and environments 

      Dikaiakos, Marios D.; Rana, O.; Ur, S.; Lourenço, J. (2008)
      The spread of systems that provide parallelism either "in-the- large" (grid infrastr-uctures, clusters) or "in-the-small" (multi -core chips), creates new opportunities for exploiting parallelism in a wider spectrum of ...